A Kind of Affine Weighted Moment Invariants

A new kind of geometric invariants is proposed in this paper, which is called affine weighted moment invariant (AWMI). By combination of local affine differential invariants and a framework of global integral, they can more effectively extract features of images and help to increase the number of low-order invariants and to decrease the calculating cost. The experimental results show that AWMIs have good stability and distinguishability and achieve better results in image retrieval than traditional moment invariants. An extension to 3D is straightforward

Segmentation and classification of leukocytes using neural networks: a generalization direction

In image digital processing, as in other fields, it is commonly difficult to simultaneously achieve a generalizing system and a specialistic system. The segmentation and classification of leukocytes is an application where this fact is evident. First an exclusively supervised approach to segmentation and classification of blood white cells images is shown. As this method produces some drawbacks related to the specialistic/generalized problems, another process formed by two neural networks is proposed. One is an unsupervised network and the other one is a supervised neural network. The goal is to achieve a better generalizing system while still doing well the role of a specialistic system. We will compare the performance of the two approaches

Fast automated cell phenotype image classification

BACKGROUND: The genomic revolution has led to rapid growth in sequencing of genes and proteins, and attention is now turning to the function of the encoded proteins. In this respect, microscope imaging of a protein's sub-cellular localisation is proving invaluable, and recent advances in automated fluorescent microscopy allow protein localisations to be imaged in high throughput. Hence there is a need for large scale automated computational techniques to efficiently quantify, distinguish and classify sub-cellular images. While image statistics have proved highly successful in distinguishing localisation, commonly used measures suffer from being relatively slow to compute, and often require cells to be individually selected from experimental images, thus limiting both throughput and the range of potential applications. Here we introduce threshold adjacency statistics, the essence which is to threshold the image and to count the number of above threshold pixels with a given number of above threshold pixels adjacent. These novel measures are shown to distinguish and classify images of distinct sub-cellular localization with high speed and accuracy without image cropping. RESULTS: Threshold adjacency statistics are applied to classification of protein sub-cellular localization images. They are tested on two image sets (available for download), one for which fluorescently tagged proteins are endogenously expressed in 10 sub-cellular locations, and another for which proteins are transfected into 11 locations. For each image set, a support vector machine was trained and tested. Classification accuracies of 94.4% and 86.6% are obtained on the endogenous and transfected sets, respectively. Threshold adjacency statistics are found to provide comparable or higher accuracy than other commonly used statistics while being an order of magnitude faster to calculate. Further, threshold adjacency statistics in combination with Haralick measures give accuracies of 98.2% and 93.2% on the endogenous and transfected sets, respectively. CONCLUSION: Threshold adjacency statistics have the potential to greatly extend the scale and range of applications of image statistics in computational image analysis. They remove the need for cropping of individual cells from images, and are an order of magnitude faster to calculate than other commonly used statistics while providing comparable or better classification accuracy, both essential requirements for application to large-scale approaches

An incremental approach to automated protein localisation

Tscherepanow M, Jensen N, Kummert F. An incremental approach to automated protein localisation. BMC Bioinformatics. 2008;9(1): 445.Background: The subcellular localisation of proteins in intact living cells is an important means for gaining information about protein functions. Even dynamic processes can be captured, which can barely be predicted based on amino acid sequences. Besides increasing our knowledge about intracellular processes, this information facilitates the development of innovative therapies and new diagnostic methods. In order to perform such a localisation, the proteins under analysis are usually fused with a fluorescent protein. So, they can be observed by means of a fluorescence microscope and analysed. In recent years, several automated methods have been proposed for performing such analyses. Here, two different types of approaches can be distinguished: techniques which enable the recognition of a fixed set of protein locations and methods that identify new ones. To our knowledge, a combination of both approaches – i.e. a technique, which enables supervised learning using a known set of protein locations and is able to identify and incorporate new protein locations afterwards – has not been presented yet. Furthermore, associated problems, e.g. the recognition of cells to be analysed, have usually been neglected. Results: We introduce a novel approach to automated protein localisation in living cells. In contrast to well-known techniques, the protein localisation technique presented in this article aims at combining the two types of approaches described above: After an automatic identification of unknown protein locations, a potential user is enabled to incorporate them into the pre-trained system. An incremental neural network allows the classification of a fixed set of protein location as well as the detection, clustering and incorporation of additional patterns that occur during an experiment. Here, the proposed technique achieves promising results with respect to both tasks. In addition, the protein localisation procedure has been adapted to an existing cell recognition approach. Therefore, it is especially well-suited for high-throughput investigations where user interactions have to be avoided. Conclusion: We have shown that several aspects required for developing an automatic protein localisation technique – namely the recognition of cells, the classification of protein distribution patterns into a set of learnt protein locations, and the detection and learning of new locations – can be combined successfully. So, the proposed method constitutes a crucial step to render image-based protein localisation techniques amenable to large-scale experiments

Snapshot navigation in the wavelet domain

Many animals rely on robust visual navigation which can be explained by snapshot models, where an agent is assumed to store egocentric panoramic images and subsequently use them to recover a heading by comparing current views to the stored snapshots. Long-range route navigation can also be explained by such models, by storing multiple snapshots along a training route and comparing the current image to these. For such models, memory capacity and comparison time increase dramatically with route length, rendering them unfeasible for small-brained insects and low-power robots where computation and storage are limited. One way to reduce the requirements is to use a compressed image representation. Inspired by the filter bank-like arrangement of the visual system, we here investigate how a frequency-based image representation influences the performance of a typical snapshot model. By decomposing views into wavelet coefficients at different levels and orientations, we achieve a compressed visual representation that remains robust when used for navigation. Our results indicate that route following based on wavelet coefficients is not only possible but gives increased performance over a range of other models